A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems
نویسندگان
چکیده
A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems Zhixiang Fang a , Wei Tu a , Qingquan Li a b , Shih-Lung Shaw a c , Shunqing Chen d & Bi Yu Chen b a State Key Laboratory of Information Engineering in Surveying, Mapping, and Remote Sensing, Wuhan University, Wuhan, PR, China b Engineering Research Center for Spatio-Temporal Data Smart Acquisition and Application, Ministry of Education of China, Wuhan, China c Department of Geography, University of Tennessee, Knoxville, TN, USA d CEO, Guangzhou Augur Intelligent Technology Co. Ltd., Guangzhou, PR China Published online: 16 Aug 2012.
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملCreating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: a Study on the Vehicle Routing Problem
Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the “neighborhood” of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the input data. For large problem instances, it is impractical to search these n...
متن کاملCreating very large scale neighborhoods out of smaller ones by compounding moves
This paper discusses neighborhood search algorithms where the size of the neighborhood is “verylarge” with respect to the size of the input data. We concentrate on such a very large scale neigh-borhood (VLSN) search technique based on compounding independent moves (CIM) such as 2-opts,swaps, and insertions. We present a systematic way of creating and searching CIM neighborhoods<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal of Geographical Information Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2013